Extremal examples of collapsible complexes and random discrete Morse theory

نویسندگان

  • Karim A. Adiprasito
  • Bruno Benedetti
  • Frank H. Lutz
چکیده

We present extremal constructions connected with the property of simplicial collapsibility. (1) For each d ≥ 2, there are collapsible (and shellable) simplicial d-complexes with only one free face. Also, there are non-evasive d-complexes with only two free faces. (Both results are optimal in all dimensions.) (2) Optimal discrete Morse vectors need not be unique. We explicitly construct a contractible, but non-collapsible 3-dimensional simplicial complex with face vector f = (106, 596, 1064, 573) that admits two distinct optimal discrete Morse vectors, (1, 1, 1, 0) and (1, 0, 1, 1). Indeed, we show that in every dimension d ≥ 3 there are contractible, non-collapsible simplicial d-complexes that have (1, 0, . . . , 0, 1, 1, 0) and (1, 0, . . . , 0, 0, 1, 1) as distinct optimal discrete Morse vectors. (3) We give a first explicit example of a (non-PL) 5-manifold, with face vector f = (5013, 72300, 290944, 495912, 383136, 110880), that is collapsible but not homeomorphic to a ball. Furthermore, we discuss possible improvements and drawbacks of random approaches to collapsibility and discrete Morse theory. We will introduce randomized versions random-lex-first and random-lex-last of the lex-first and lex-last discrete Morse strategies of [9], respectively — and we will see that in many instances the random-lex-last strategy works significantly better than Benedetti–Lutz’s (uniform) random strategy. On the theoretical side, we prove that after repeated barycentric subdivisions, the discrete Morse vectors found by randomized algorithms have, on average, an exponential (in the number of barycentric subdivisions) number of critical cells asymptotically almost surely. Supported by an EPDI postdoctoral fellowship and by the Romanian NASR, CNCS — UEFISCDI, project PN-II-ID-PCE-2011-3-0533. Supported by the DFG Coll. Research Center TRR 109, “Discretization in Geometry and Dynamics” and NSF Grant 1600741, ”‘Geometric Combinatorics and Discrete Morse Theory Supported by the DFG Research Group “Polyhedral Surfaces”, by the DFG Coll. Research Center TRR 109 “Discretization in Geometry and Dynamics”, by VILLUM FONDEN through the Experimental Mathematics Network and by the Danish National Research Foundation (DNRF) through the Centre for Symmetry and Deformation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimal Decision Trees on Simplicial Complexes

We consider topological aspects of decision trees on simplicial complexes, concentrating on how to use decision trees as a tool in topological combinatorics. By Robin Forman’s discrete Morse theory, the number of evasive faces of a given dimension i with respect to a decision tree on a simplicial complex is greater than or equal to the ith reduced Betti number (over any field) of the complex. U...

متن کامل

Discrete Morse theory for the collapsibility of supremum sections

The Dushnik-Miller dimension of a poset ≤ is the minimal number d of linear extensions ≤1, . . . ,≤d of ≤ such that ≤ is the intersection of ≤1, . . . ,≤d. Supremum sections are simplicial complexes introduced by Scarf [13] and are linked to the Dushnik-Miller as follows: the inclusion poset of a simplicial complex is of Dushnik-Miller dimension at most d if and only if it is included in a supr...

متن کامل

Extraction Of Feature Lines On Surface Meshes Based On Discrete Morse Theory

We present an approach for extracting extremal feature lines of scalar indicators on surface meshes, based on discrete Morse Theory. By computing initial Morse-Smale complexes of the scalar indicators of the mesh, we obtain a candidate set of extremal feature lines of the surface. A hierarchy of Morse-Smale complexes is computed by prioritizing feature lines according to a novel criterion and a...

متن کامل

TADD: A Computational Framework for Data Analysis Using Discrete Morse Theory

This paper presents a computational framework that allows for a robust extraction of the extremal structure of scalar and vector fields on 2D manifolds embedded in 3D. This structure consists of critical points, separatrices, and periodic orbits. The framework is based on Forman’s discrete Morse theory, which guarantees the topological consistency of the computed extremal structure. Using a gra...

متن کامل

Greedy Morse matchings and discrete smoothness

Discrete Morse theory emerged as an essential tool for computational geometry and topology. Its core structures are discrete gradient fields, defined as acyclic matchings on a complex C, from which topological and geometrical information of C can be efficiently computed, in particular its homotopy, homology, or Morse-Smale decomposition. On the geometrical side, given a function f sampled on C,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Discrete & Computational Geometry

دوره 57  شماره 

صفحات  -

تاریخ انتشار 2017